Location:
Search - b tree
Search list
Description: B树的相关算法。源程序，C文件压缩。包括建立，插入等等相关的操作。-B-tree algorithms. The source, C compression. Including, insert, etc. related to the operation.
Platform: |
Size: 1024 |
Author: 王小娅 |
Hits:
Description: BTREE 树形文件处理系统 灵活,好用 欢迎下载使用-BTREE tree document processing system is flexible, user-friendly welcome to use the download
Platform: |
Size: 39936 |
Author: 闫中玉 |
Hits:
Description: （利用GIF_LZW算法实现的）网络图片传输 技术特点 ~~~~~~~~ 一、使用TCP协议传输数据。理由：稳定性好。 二、使用字节数据流进行传输，理由： A:VB的String存在自动Unicode转换问题，影响速度； B:可以直接发送8位字节数据，不需要使用Base64编码，从而减少了编码时间。 三、使用GIF-LZW压缩算法压缩图像。理由： A:行程编码、Huffman压缩算法压缩率太低； B:JPEG压缩算法需要太多位运算，且运算量大（有专门MMX优化算法），不利于VB实现； C:GIF-LZW压缩算法压缩率较好，且我已想出VB语法下高效GIF-LZW压缩/解压算法。 四、使用“有序抖动”算法进行 色彩量化。理由：“有序抖动”处理的结果具有一定规律性，有助于LZW类算法压缩。-(using GIF_LZW algorithm) picture transmission network ~~~~~~~~ a technical features, the use of TCP to transmit data. Reason : good stability. Two, the use of byte data stream for transmission, reasons : A : VB String exist automatically Unicode conversion, the impact speed; B : can directly send eight bytes of data and do not need to use Base64 encoding, thereby reducing the coding time. 3, the use of GIF- LZW compression algorithm for image compression. Reason : A : itinerary coding, Huffman compression algorithm compression rate is too low; B : JPEG compression algorithm needs much-bit computing, and large amount of computation (with MMX specialized optimization algorithm), is not conducive to VB; C : GIF- LZW compression algorithm compression ratio better, and I have come up with un
Platform: |
Size: 62464 |
Author: 房 |
Hits:
Description: 计算用运算符后缀法表示的表达式的值。后缀表达式也称逆波兰表达式，比中缀表达式计算起来更方便简单些，中缀表达式要计算就存在着括号的匹配问题，所以在计算表达式值时一般都是先转换成后缀表达式，再用后缀法计算表达式的值。如：表达式(a+b*c)/d-e用后缀法表示应为abc*+d/e-。只考虑四则算术运算，且假设输入的操作数均为1位十进制数（0—9），并且输入的后缀形式表达式不含语法错误-calculated Operators suffix France said the value of the expression. Suffix expression also called inverse Poland expression, which is made up of formulas can be more convenient for some simple, ordinary expression to calculate the brackets on the existence of the matching problem, in the calculation of expression values are generally first converted into a suffix expression, reuse suffix calculated the value of the expression. Such as : The expression (a, b* c)/d-e suffix method used to be said for abc* d/e-. Consider only four arithmetic operations and the operation of input assumptions are a few decimal (0-9), and enter the suffix-free form expression syntax errors
Platform: |
Size: 1024 |
Author: 刘一 |
Hits:
Description: b树的C++实现,运用模板实现B树 简单明了-C achieved, the use template simple B-tree
Platform: |
Size: 10240 |
Author: 冯 |
Hits:
Description: R树与B树的混合树，在这个程序里面可以直接用R树和B树-R and B-tree tree of mixed tree, in the inside can directly with the R and B-tree tree
Platform: |
Size: 1152000 |
Author: 张军旗 |
Hits:
Description: 一个采用B-树数据结构制作的图书馆管理程序，功能较简单，适合大学生数据结构参考使用-use a B-tree data structures produced by the library management procedures and functions than simple data structure suitable for college students to use reference
Platform: |
Size: 6144 |
Author: 吴晓辉 |
Hits:
Description: 1． 汽车轮渡口，过江渡船每次能载10辆车过江，过江车辆分为客车类和货车类，上渡船有如下规定：同类车先到先上船，客车先于货车上渡船，且每上4辆客车，才允许上一辆货车。若等待客车不足4辆，则从货车代替，若无货车等待允许客车上船。试写一个算法模拟渡口管理。
算法设计:
1客车和货车均建立一个链式队列，初始均为空。以后来一辆车不是货车就是客车，因此可以说整个程序的事件驱动event就是这两个,客车表示1，货车表示0.
2轮船还没有到达时客车和货车均按次序排在各自队列中。
3轮船到达时，根据两个队列的情况，分别处理。处理如下：
a 客车数不满4辆，则将排在前面的货车上船，但总数不能超过10，若没有货车等待，客车直接上船。
b 客车数满4，但不满8辆，客车先上，排在前面的只有一辆货车可以上船，若没有货车等待则货车不上。
c 客车满8辆但不满10，客车上船，排在前面的货车最多可以上2辆，但总数不能超过10。
d 客车满10，则全上客车,但总数不能超过10。
-1. I car ferry, crossing the river each ferry can carry 10 cars crossing the river, crossing the river into passenger vehicles and goods category, Ferry on the following provisions : first vehicle in a first embarkation, the first passenger ferry in the truck and four on each passenger will be permitted on a lorry. If waiting for the bus less than four, then replace the truck, without waiting for the lorry to allow passenger embarkation. Try to write a simulated crossing management. Algorithm design : a bus and the truck were established a chain cohort, the initial were empty. Later, a car is not a passenger vehicle is, it can be said of the entire process event-driven event is the two, said a passenger, said the lorry 0. Two ships have not yet arrived at the bus and the truck were ranked
Platform: |
Size: 2048 |
Author: 西们子 |
Hits:
Description: 用c开发的B+树索引结构,能实现B+树基本的查找,删除,搜索功能-with the development of B-tree index structures to achieve the basic B-tree search, delete, search functions
Platform: |
Size: 15360 |
Author: 皇者之剑 |
Hits:
Description: CMXBTree 的主要作用是在内存中建立一棵B+树，主要针对数据量较大，查询频繁的数据。总之，CMXBTree 可被视作一个在内存中的数据库使用。其特点是：短小精悍。-CMXBTree major role in the establishment of a memory B-tree, mainly larger volume of data, inquiries frequent data. In short, CMXBTree be deemed to be a memory in the database used. Its features are : short and pithy.
Platform: |
Size: 157696 |
Author: ben |
Hits:
Description: 用VC++编的树控件程序，能通过弹出式菜单任意添加树条目-VC series of the tree control procedures, through pop-up menu to add arbitrary tree entries
Platform: |
Size: 15360 |
Author: 郭治 |
Hits:
Description: 数据结构设计--平衡二叉树的实现,完整实现二叉树算法-data structure design-- achieving a balanced binary tree, to achieve complete binary tree algorithm
Platform: |
Size: 248832 |
Author: 小枫 |
Hits:
Description: 用V B写的一个冒险岛的外挂吸怪的源程序. -V-B was an adventure of the island of external strange absorption of the source.
Platform: |
Size: 25600 |
Author: jay |
Hits:
Description: 有关B-树的删除添加修改操作-the B-tree to add amendments to delete operation
Platform: |
Size: 9216 |
Author: 冯淞 |
Hits:
Description: 无线传感网络MAC层代码，适用树状的网络拓扑图以及信息收集-wireless sensor networks MAC layer code, the applicable tree network topology map and information collection
Platform: |
Size: 225280 |
Author: 夏雪 |
Hits:
Description: 数据结构课程源码，b树的示例代码。老师的示范程序-source data structure courses, b tree sample code. The model for teachers
Platform: |
Size: 6144 |
Author: 张龙飞 |
Hits:
Description: 1问题描述：
设计一个实现稀疏多项式乘法的程序
2需求分析：
编程实现两个一元多项式相乘，要求：
2.1输入并建立多项式；
2.2输出多项式，输出形式为整数序列：n,c1,e1,c2,e2``````,cn.,en,其中n是多项式的系数，ci和ei分别是第i项的系数和指数，序列按指数降序排列。
2.3多项式a和b相乘，建立结果多项式a*b
-a Problem description : Design a sparse polynomial multiplication achieve the two procedures demand analysis : Programming 2 1 yuan polynomial multiplication, requirements : 2.1 to import and establish polynomial; 2.2 Output polynomial, Output form of integer sequence : n, c1, e1, c2, e2 ``````, cn. , en, where n is the polynomial coefficients, respectively ei ci and is the first item i coefficient and the index sequence index in descending order. 2.3 polynomial multiplication a and b, the results establish a* b polynomial
Platform: |
Size: 50176 |
Author: 王并 |
Hits:
Description: 用VC。NET2005实现优秀的最近邻搜索算法LB-TREE的模拟和图形显示。具有建立优良数据结构和搜索功能-VC.NET2005 achieve outstanding nearest neighbor search algorithm LB-TREE simulation and graphics. With excellent data structure and search functions
Platform: |
Size: 4157440 |
Author: yangtao |
Hits:
Description: 二元树的六种遍历方法，前中后递归非递归遍历，-Binary tree traversal of the six methods, the former in the post-recursive non-recursive traversal,
Platform: |
Size: 118784 |
Author: walkbeef |
Hits:
Description: B树-B tree
Platform: |
Size: 156672 |
Author: 子小 |
Hits:
«
1
2
3
4
5
67
8
9
10
11
...
31
»